翻訳と辞書 Words near each other ・ Literacy in American Lives ・ Literacy In Bihar ・ Literacy in India ・ Literacy in Media Award ・ Literacy in Romania ・ Literacy in the United States ・ Literacy in Tokelau ・ Literacy Is Empowering Project ・ Literacy test ・ Literacy Training Service ・ Literacy Volunteers of Illinois ・ Literae Humaniores ・ Literal ・ Literal (computer programming) ・ Literal (magazine) ・ Literal (mathematical logic) ・ Literal and figurative language ・ Literal contracts in Roman law ・ Literal Latte ・ Literal movement grammar ・ Literal music video ・ Literal pool ・ Literal translation ・ Literalism ・ Literariness ・ Literarische Donaugesellschaft ・ Literary activism ・ Literary adaptation ・ Literary agent ・ Literary and colloquial readings of Chinese characters Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Literal (mathematical logic) ： ウィキペディア英語版 Literal (mathematical logic) In mathematical logic, a literal is an atomic formula (atom) or its negation. The definition mostly appears in proof theory (of classical logic), e.g. in conjunctive normal form and the method of resolution. Literals can be divided into two types: * A positive literal is just an atom. * A negative literal is the negation of an atom. For a literal $l$, the complementary literal is a literal corresponding to the negation of $l$, we can write $\backslash bar$ to denote the complementary literal of $l$. More precisely, if $l\backslash equiv\; x$ then $\backslash bar$ is $\backslash lnot\; x$ and if $l\backslash equiv\; \backslash lnot\; x$ then $\backslash bar$ is $x$. In the context of a formula in the conjunctive normal form, a literal is pure if the literal's complement does not appear in the formula. == Examples == In propositional calculus a literal is simply a propositional variable or its negation. In predicate calculus a literal is an atomic formula or its negation, where an atomic formula is a predicate symbol applied to some terms, $P(t\_1,\backslash ldots,t\_n)$ with the terms recursively defined starting from constant symbols, variable symbols, and function symbols. For example, $\backslash neg\; Q(f(g(x),\; y,\; 2),\; x)$ is a negative literal with the constant symbol 2, the variable symbols ''x'', ''y'', the function symbols ''f'', ''g'', and the predicate symbol ''Q''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Literal (mathematical logic)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.